recursive function造句
例句与造句
- Is a recursive function - it accepts a node set in the
是一个递归函数，它用 - Non - recursive simulation on recursive function
递归函数的非递归模拟 - But walking a tree just by using recursive functions is not all that difficult
但是只用递归函数来遍历树并不十分困难。 - In addition , recursive functions add significant expressive power to the language
此外，递归函数也增强了语言的表达能力。 - This can be especially useful when you are debugging a recursive function , a function that calls itself
在调试递归函数（调用自身的函数）时，这个功能尤其有用。 - It's difficult to find recursive function in a sentence. 用recursive function造句挺难的
- Instead , the transformation from tail - recursive function to simple loop must be done dynamically by a jit compiler
相反地，这种从尾递归函数到简单循环的转换必须由jit编译器动态地进行。 - You must iterate through the controls of each container control separately ; this can be done using a recursive function
必须分别循环访问每个容器控件的控件；可使用递归函数完成此操作。 - Like recursive function , recursive sql for db2 express can recursively use the result set to get to the final result
与递归函数类似， db2 express的递归sql可递归地使用结果集来得到最终结果 - But although it is well known how to automatically transform a tail - recursive function into a simple loop , the java specification doesn t require that this transformation be made
但是，尽管大家都熟知如何把一个尾递归函数自动转换成一个简单循环， java规范却不要求做这种转换。 - Lfc is a formal specification language based on recursive functions defined on context free languages ( cfrf ) and supports the acquisition and validation of formal specification very well
同时lfc也是一种函数式语言，具有良好的数学基础、引用透明、无副作用、模式匹配等特点。 - The solution is relatively simple : because these tail - recursive functions are really just easier ways of writing loops , have the compiler automatically transform them to loops
解决方案比较简单：因为尾递归函数实际上只是编写循环的一种更简单的方式，所以就让编译器把它们自动转换成循环形式。 - Because of this attribute , there is a nice correspondence between tail - recursive functions and loops : each recursive call can be thought of simply as one more iteration through a loop
由于这一特点，在尾递归函数和循环之间有一个很好的对应关系：可以简单地把每个递归调用看作是一个循环的多次迭代。